The Power of the Claw

نویسندگان

  • Bruce M. Rothschild
  • Bill Bryant
  • Christopher Hubbard
  • Kent Tuxhorn
  • Ginny Penn Kilgore
  • Larry Martin
  • Virginia Naples
چکیده

Scratches on bones have routinely been attributed to tooth marks (a predominantly untested speculation), ignoring the effects of claws, perhaps because of the general assumption that claws are too soft to damage bone. However, some pathologies appears to be more compatible with claw rather than tooth impacts. Therefore, it is critical to determine if the claws of any animal are capable of scratching into the surface of any bone--a test and proof of concept. A tiger enrichment program was used to document actual bone damage unequivocally caused by claws, by assuring that the tiger had access to bones only by using its paws (claws). The spectrum of mechanisms causing bone damage was expanded by evidentiary analysis of claw-induced pathology. While static studies suggested that nails/claws could not disrupt bone, specific tiger enrichment activities documented that bones were susceptible to damage from the kinetic energy effect of the striking claw. This documents an expanded differential consideration for scratch marks on bone and evidences the power of the claw.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Footpad horn hypertrophy and vertical fissure accompanied by white line disease 2 in case of concurrent deep digital sepsis in a culling cow

A5.2 year-old Holstein cow was presented with lameness andabnormal weight bearing in a slaughterhouse. Widening of theperiople and swelling of the heel area in the lateral claw was morepermanent than the medial claw. Vertical fissure (VF) involvingthe coronary band to the middle of the dorsal wall of the medialhind claw was observed. It was also extended to the bearingsurface in the inner surfa...

متن کامل

Generalized power domination of graphs

In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...

متن کامل

On the Erdös-Gyárfás conjecture in claw-free graphs

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs.

متن کامل

Effect of white spot syndrome virus on the activity of immune-related enzymes in the red claw crayfish (Cherax quadricarinatus)

In this study, we explored the pathogenic effects of white spot syndrome virus (WSSV) and effects of yeast cell wall in the red claw crayfish, Cherax quadricarinatus, by investigating the activity of enzymes related to innate immune function following artificial infection of immunized and non-immunized crayfish. Our results reveal that the activity of four enzymes, phenoloxidase (PO), peroxidas...

متن کامل

Effect of white spot syndrome virus on the activity of immune-related enzymes in the red claw crayfish (Cherax quadricarinatus)

In this study, we explored the pathogenic effects of white spot syndrome virus (WSSV) and effects of yeast cell wall in the red claw crayfish, Cherax quadricarinatus, by investigating the activity of enzymes related to innate immune function following artificial infection of immunized and non-immunized crayfish. Our results reveal that the activity of four enzymes, phenoloxidase (PO), peroxidas...

متن کامل

The complement of proper power graphs of finite groups

For a finite group G, the proper power graph P∗(G) of G is the graph whose vertices are non-trivial elements of G and two vertices u and v are adjacent if and only if u 6= v and um = v or vm = u for some positive integer m. In this paper, we consider the complement of P∗(G), denoted by P(G). We classify all finite groups whose complement of proper power graphs is complete, bipartite, a path, a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013